An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls
نویسندگان
چکیده
منابع مشابه
An Insertion Heuristic for the Capacitated Vehicle Routing Problem with Loading Constraints and Mixed Linehauls and Backhauls
In this paper, a capacitated vehicle routing problem with mixed linehauls and backhauls is presented. The addressed problem belongs to the subclass of pickup and delivery problems. Loading and sequencing constraints are also considered. These constraints arise in many realworld situations, and can improve efficiency since backhaul customers do not need to be delayed in a route when it is possib...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملMetaheuristics for the Vehicle Routing Problem with Clustered Backhauls and 3D Loading Constraints
In this paper, we extend the vehicle routing problem with clustered backhauls (VRPCB) to an integrated routing and three-dimensional loading problem, called VRPCB with 3D loading constraints (3L-VRPCB). In the VRPCB each customer is either a linehaul or a backhaul customer and in each route all linehaul customers must be visited before any backhaul customer. In the 3L-VRPCB, each customer deman...
متن کاملHeuristic Methods for Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: FME Transaction
سال: 2015
ISSN: 1451-2092
DOI: 10.5937/fmet1504311p